A Correctness Proof of a Cache Coherence Protocol
نویسندگان
چکیده
SCI – Scalable Coherent Interface – is a new IEEE standard for specifying communicationbetween multiprocessors in a shared memory model. In this paper we model part of SCI by a program written in a UNITY-like programming language. This part of SCI is formally specified in Manna and Pnueli’s Linear Time Temporal Logic (LTL). We prove that the program satisfies its specification. The proof is carried out within LTL and uses history variables. Structuring of the proof is achieved by means of auxiliary predicates.
منابع مشابه
A Proof of Correctness for the Tardis Cache Coherence Protocol
We prove the correctness of a recently-proposed cache coherence protocol, Tardis, which is simple, yet scalable to high processor counts, because it only requires O(logN) storage per cacheline for an N processor system. We prove that Tardis follows the sequential consistency model and is both deadlockand livelock-free. Our proof is based on simple and intuitive invariants of the system and thus...
متن کاملParaVerifier: An Automatic Framework for Proving Parameterized Cache Coherence Protocols
Parameterized verification of cache coherence protocols is an important but challenging research problem. We present in this paper our automatic framework paraVerifier to handle this problem: (1) it first discovers auxiliary invariants and the corresponding causal relations between invariants and protocol rules from a small reference instance of the verified protocol; (2) the discovered invaria...
متن کاملThe Verification of the On-Chip COMA Cache Coherence Protocol
This paper gives a correctness proof for the on-chip COMA cache coherence protocol that supports the Microgrid of microthreaded architecture, a multi-core architecture capable of integrating hundreds to hundreds of thousands of processors on single silicon chip. We use the Abstract State Machine (ASM) as a theoretical framework for the specification of the on-chip COMA cache coherence protocol....
متن کاملProofs of Correctness of Cache-Coherence Protocols
We describe two proofs of correctness for Cachet, an adaptive cache-coherence protocol. Each proof demonstrates soundness (conformance to an abstract cache memory model CRF) and liveness. One proof is manual, based on a term-rewriting system de nition; the other is machine-assisted, based on a TLA formulation and using PVS. A twostage presentation of the protocol simpli es the treatment of soun...
متن کاملVerifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement
We combine compositional reasoning and reachability analysis to formally verify the safety of a recent cache coherence protocol. The protocol is a detailed implementation of token coherence, an approach that decouples correctness and performance. First, we present a formal and abstract specification that captures the safety substrate of token coherence, and highlights the symmetry in states of ...
متن کاملParameterized Cache Coherence Protocol Verification using Invariant
Verification of parameterized cache coherence protocol is very important in the share-memory multiprocessor system. In this paper, a new method was proposed to verify the correctness of parameterized cache coherence protocol based on the invariant. Firstly, we present the parameterized cache coherence protocol as semi-algebraic transition system, and then solve the invariant of transition syste...
متن کامل